Lattice Green's Functions of the Higher-Dimensional Face-Centered Cubic Lattices

نویسنده

  • Christoph Koutschan
چکیده

We study the lattice Green’s functions of the face-centered cubic lattice (fcc) in up to six dimensions. We give computer algebra proofs of results that were conjectured by Guttmann and Broadhurst for the fourand fivedimensional fcc lattices. Additionally we derive a differential equation for the lattice Green’s function of the six-dimensional fcc lattice, a result that was not believed to be achievable with current computer hardware.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice Green's functions in all dimensions

We give a systematic treatment of lattice Green’s functions (LGF) on the d-dimensional diamond, simple cubic, body-centred cubic and face-centred cubic lattices for arbitrary dimensionality d 2 for the first three lattices, and for 2 d 5 for the hyper-fcc lattice. We show that there is a close connection between the LGF of the d-dimensional hyper-cubic lattice and that of the (d − 1)-dimensiona...

متن کامل

Uniform Sampling and Reconstruction of Trivariate Functions

The Body Centered Cubic (BCC) and Face Centered Cubic (FCC) lattices have been known to outperform the commonly-used Cartesian sampling lattice due to their improved spectral sphere packing properties. However, the Cartesian lattice has been widely used for sampling of trivariate functions with applications in areas such as biomedical imaging, scientific data visualization and computer graphics...

متن کامل

Sampling and Aliasing Properties of Three-Dimensional Point-Lattices

Sampling properties of some three-dimensional lattices are examined. The Cartesian cubic lattice is compared with the non-Cartesian faceand body-centered cubic lattices. Numerical computations using analytical functions are used to compare rotational dependency and aliasing effects.

متن کامل

Quantizing Using Lattice Intersections

The usual quantizer based on an n-dimensional lattice Λ maps a point x ∈ Rn to a closest lattice point. Suppose Λ is the intersection of lattices Λ1, . . . ,Λr. Then one may instead combine the information obtained by simultaneously quantizing x with respect to each of the Λi. This corresponds to decomposing Rn into a honeycomb of cells which are the intersections of the Voronoi cells for the Λ...

متن کامل

Universal finite-size scaling functions for percolation on three-dimensional lattices

Using a histogram Monte Carlo simulation method ~HMCSM!, Hu, Lin, and Chen found that bond and site percolation models on planar lattices have universal finite-size scaling functions for the existence probability Ep , the percolation probability P , and the probability Wn for the appearance of n percolating clusters in these models. In this paper we extend above study to percolation on three-di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1108.2164  شماره 

صفحات  -

تاریخ انتشار 2011